Planning and Consensus among Autonomous Agents
نویسندگان
چکیده
Preface This dissertation describes research in the eld of Distributed Artiicial Intelligence (DAI). DAI is the subbeld of Artiicial Intelligence that investigates the behavior of societies of artiicial agents (high-level, interacting computer programs). The speciic research of the dissertation focuses on multi-agent planning under various models of interaction. Within the eld of DAI there is a distinction between two research agendas, Distributed Problem Solving and Multi-Agent Systems. Within the rst paradigm, agents can be assumed to be created by the same designer or body, and thus, work together to solve common goals. Using economic terms, the agents have a common preference proole that yields an identical utility function. The common goal(s) may be decomposed into subgoals that are allocated to diierent agents in the group. Coordination is needed to allow eecient distributed activity towards the achievement of the global goal. While pursuing their tasks, agents may communicate, share their knowledge, and benevolently help one another. In the Multi-Agent Systems paradigm, on the other hand, there is not assumed to be any one designer who can impose any speciic kind of behavior directly on all the agents. Agents, designed by diierent people, may have their own private goals and act sellshly towards the achievement of these goals. Therefore each agent may have its private proole of preferences, and a distinct individual utility function. This dissertation deals with both Distributed Problem Solving and Multi-Agent Systems issues. The subject of multi-agent planning, a major focus of the dissertation, has been of continuing concern in DAI. Some of the earliest work in the eld directly addressed the question of how to get groups of agents to carry out coordinated, coherent activity. These questions have occupied researchers both in the Distributed Problem Solving sub-area of DAI as well as those working on Multi-Agent Systems. The term multi-agent planning has been used to describe both \planning for multiple agents" (where the planning process itself may be centralized), and \planning by multiple agents" (where the planning process is distributed among the agents). Chapter 1 discuss models of interaction, presents our approach, and discusses related work. Chapter 2 introduces a novel combination of the two distinct multi-agent planning approaches mentioned above. We analyze a particular model of control among intelligent agents, that of iv non-absolute control. Non-absolute control involves a \supervisor" agent that issues orders to a \subordinate" agent. Both agents operate with essentially the same goals. The …
منابع مشابه
Multi-Agent Planning as a Dynamic Search for Social Consensus
When autonomous agents attempt to coordinate action, it is often necessary that they reach some kind of consensus. Reaching consensus has traditionally been dealt with in the Distributed Artiicial Intelligence literature via negotiation. Another alternative is to have agents use a voting mechanism; each agent expresses its preferences, and a group choice mechanism is used to select the result. ...
متن کاملAdaptive Neural Network Method for Consensus Tracking of High-Order Mimo Nonlinear Multi-Agent Systems
This paper is concerned with the consensus tracking problem of high order MIMO nonlinear multi-agent systems. The agents must follow a leader node in presence of unknown dynamics and uncertain external disturbances. The communication network topology of agents is assumed to be a fixed undirected graph. A distributed adaptive control method is proposed to solve the consensus problem utilizing re...
متن کاملFlexible problem-solving roles for autonomous agents
Abstract Agent-based technologies can be applied to many aspects of manufacturing. The need for responsive, flexible agents is pervasive in manufacturing environments due to the complex, dynamic nature of manufacturing problems. One critical aspect of agent flexibility is the ability to adapt problem-solving roles to various situations during system operation. This issue is addressed by researc...
متن کاملA Consensus Algorithm for Synchronous Distributed Systems using Mobile Agent
In this paper, we present a consensus algorithm for synchronous distributed systems using cooperating mobile agents. The algorithm is designed within a framework for mobile agent enabled distributed server groups (MADSG), where cooperating mobile agents are used to achieve coordination among the servers. Being autonomous and cooperative, cooperating mobile agents exchange information among them...
متن کاملDistributed Asynchronous Planning and Task Allocation Algorithm for Autonomous Cluster Flight of Fractionated Spacecraft
For autonomous cluster flight of fractionated spacecraft, planning and task allocation are important as they bridge the gap between the top-level layer (interpreting inputs from the environment) and the bottom-level layer (local controllers) of the distributed space system. This paper presents an asynchronous distributed algorithm that is able to implement planning and task allocation concurren...
متن کاملApplying Dynamic Planning Frameworks to Agent Goals
Agent-based systems require flexibility to perform effectively in complex and dynamic environments. When appropriate, agents should be able to take initiative for completing assigned tasks in the absence of supervisory input. Agents should also be able to determine if they can efficiently achieve a goal alone or if they need assistance from other agents in their system. In response to these dec...
متن کامل